A globally convergent primal-dual interior-point filter method for nonlinear programming
نویسندگان
چکیده
منابع مشابه
A globally convergent primal-dual interior-point three-dimensional filter method for nonlinear semidefinite programming
This paper proposes a primal-dual interior-point filter method for nonlinear semidefinite programming, which is the first multidimensional (three-dimensional) filter methods for interior-point methods, and of course for constrained optimization. A freshly new definition of filter entries is proposed, which is greatly different from those in all the current filter methods. A mixed norm is used t...
متن کاملA globally convergent primal-dual interior-point filter method for nonlinear programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primaldual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty parameters. The new algorithm decomposes the primal-dual step obtained from the perturbed first-order necessary conditions into a normal and a tangential step, whose sizes are co...
متن کاملA Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primaldual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty parameters. The new algorithm decomposes the primal-dual step obtained from the perturbed first-order necessary conditions into a normal and a tangential step, whose sizes are co...
متن کاملA Globally Convergent Primal-dual Interior-point Filter Method for Nonlinear Programming: New Filter Optimality Measures and Computational Results
In this paper we prove global convergence for first and second-order stationarity points of a class of derivative-free trust-region methods for unconstrained optimization. These methods are based on the sequential minimization of linear or quadratic models built from evaluating the objective function at sample sets. The derivative-free models are required to satisfy Taylor-type bounds but, apar...
متن کاملA primal-dual interior point method for nonlinear semidefinite programming
In this paper, we consider a primal-dual interior point method for solving nonlinear semidefinite programming problems. By combining the primal barrier penalty function and the primal-dual barrier function, a new primal-dual merit function is proposed within the framework of the line search strategy. We show the global convergence property of our method.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2004
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-003-0477-4